翻訳と辞書 Words near each other ・ List of pseudo-French words adapted to English ・ List of pseudo-German words adapted to English ・ List of pseudonyms ・ List of pseudonyms of angling authors ・ List of pseudonyms used in the American Constitutional debates ・ List of pseudoscientific water fuel inventions ・ List of Psi Omega chapters ・ List of Psi Upsilon chapters ・ List of Psilocybe species ・ List of psilocybin mushrooms ・ List of Psittaciformes by population ・ List of Psittacosaurus species ・ List of PSone Classics (Japan) ・ List of PSone Classics (North America) ・ List of PSone Classics (PAL region) ・ List of PSPACE-complete problems ・ List of PSV Eindhoven players ・ List of Psych cast members ・ List of Psych characters ・ List of Psych episodes ・ List of psych folk artists ・ List of Psych guest stars ・ List of psychedelic drugs ・ List of psychedelic pop groups ・ List of psychedelic rock artists ・ List of psychiatric hospitals in India ・ List of psychiatric medications ・ List of psychiatric medications by condition treated ・ List of psychiatrists ・ List of psychiatry journals Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク List of PSPACE-complete problems ： ウィキペディア英語版 List of PSPACE-complete problems Here are some of the more commonly known problems that are PSPACE-complete when expressed as decision problems. This list is in no way comprehensive. == Games and puzzles == Generalized versions of: Amazons Atomix · Checkers〔Assuming a draw after a polynomial number of moves. 〕 · Dyson Telescope Game · Cross Purposes · Geography · Ko-free Go · Ladder capturing in Go〔(Go ladders are PSPACE-complete )〕 · Gomoku · Hex · Konane〔 · Node Kayles · Poset Game〔.〕 · Reversi · River Crossing〔 · Rush Hour · Finding optimal play in Mahjong solitaire〔A. Condon, J. Feigenbaum, C. Lund, and P. Shor, Random debaters and the hardness of approximating stochastic functions, SIAM Journal on Computing 26:2 (1997) 369-400.〕 · Sokoban〔 · Black Pebble game〔Gilbert, Lengauer,and R. E. Tarjan: The Pebbling Problem is Complete in Polynomial Space. SIAM Journal on Computing, Volume 9, Issue 3, 1980, pages 513-524.〕 · Black-White Pebble game〔Philipp Hertel and Toniann Pitassi: (Black-White Pebbling is PSPACE-Complete )〕 · Acyclic pebble game〔Takumi Kasai, Akeo Adachi, and Shigeki Iwata: ''Classes of Pebble Games and Complete Problems'', SIAM Journal on Computing, Volume 8, 1979, pages 574-586.〕 · One-player pebble game〔 · Token on acyclic directed graph games:〔 Annihilation; Hit; Capture; Edge Blocking; Target; Pursuit 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「List of PSPACE-complete problems」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.